A QCQP Approach to Triangulation
نویسندگان
چکیده
Triangulation of a three-dimensional point from n ≥ 2 twodimensional images can be formulated as a quadratically constrained quadratic program. We propose an algorithm to extract candidate solutions to this problem from its semidefinite programming relaxations. We then describe a sufficient condition and a polynomial time test for certifying when such a solution is optimal. This test has no false positives. Experiments indicate that false negatives are rare, and the algorithm has excellent performance in practice. We explain this phenomenon in terms of the geometry of the triangulation problem.
منابع مشابه
Application of triangulation approach in requirements engineering process: A study in analysis and design of the pediatrics epilepsy information system
Introduction: Requirements Engineering process is a crucial phase in software development. In order to achieve a successful design of health information systems (HISs), applying the best methodologies is essential. Therefore, the aim of the present study was to design pediatrics Epilepsy Information System (EPIS) as well as the use of triangulation approach in elicitation and validation of epil...
متن کاملOn Efficient Semidefinite Relaxations for Quadratically Constrained Quadratic Programming
Two important topics in the study of Quadratically Constrained Quadratic Programming (QCQP) are how to exactly solve a QCQP with few constraints in polynomial time and how to find an inexpensive and strong relaxation bound for a QCQP with many constraints. In this thesis, we first review some important results on QCQP, like the S-Procedure, and the strength of Lagrangian Relaxation and the semi...
متن کاملAn interior point algorithm for solving a special QCQP that occurs in bundle methods
We present an implementation of an interior point algorithm for solving a special QCQP that can be used for determining the search direction in bundle methods for nonlinearly constrained nonsmooth optimization.
متن کاملRepresenting quadratically constrained quadratic programs as generalized copositive programs
We show that any nonconvex quadratically constrained quadratic program (QCQP) can be represented as a generalized copositive program. In fact, we provide two representations. The first is based on the concept of completely positive (CP) matrices over second order cones, while the second is based on CP matrices over the positive semidefinte cone. Our analysis assumes that the feasible region of ...
متن کاملSpacecraft Attitude Control under Constrained Zones via Quadratically Constrained Quadratic Programming
This paper examines an optimal spacecraft attitude control problem in the presence of complicated attitude forbidden and mandatary zones. The objective is to design an optimal reorientation trajectory for a rigid body spacecraft under constraints, which is originally formulated as a nonlinear programming problem. The attitude forbidden zones are considered to prevent the light-sensitive instrum...
متن کامل